An estimation of distribution algorithm for lot-streaming flow shop problems with setup times
نویسندگان
چکیده
منابع مشابه
Modelling the Lot Streaming Problem with Setup times in a Job Shop Manufacturing System
This paper aims at solving the lot streaming problem in a job shop environment, where setup times are involved. The proposed integer programming formulation sufficiently describes the processing dynamics of individual sublots and enables the simultaneous determination of schedules on machines and sublot sizes. Small instances of job shop problems with consistent sublots can thus be optimally so...
متن کاملLot Streaming in Hybrid Flow Shop Scheduling
Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical m...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملAn Improved Fruit Fly Optimization Algorithm for Solving Lot-streaming Flow-shop Scheduling Problem
An improved fruit fly optimization algorithm (iFOA) is proposed in this paper for solving the lot-streaming flow-shop scheduling problem (LSFSP) with equal-size sub-lots. In the proposed iFOA, a solution is represented as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme, three kinds of neighborhoods are developed for ge...
متن کاملAn effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem
This paper presents an effective shuffled frogleaping algorithm (SFLA) for solving a lot-streaming flow shop scheduling problem with equal-size sublots, where a criterion is to minimize maximum completion time (i.e., makespan) under both an idling and no-idling production cases. Unlike the original SFLA, the proposed SFLA represents an individual or frog as a job permutation and utilizes a posi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2012
ISSN: 0305-0483
DOI: 10.1016/j.omega.2011.05.002